Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
نویسندگان
چکیده
منابع مشابه
Inverse and Injectivity of Parallel Relations Induced by Cellular Automata
Moore and Myhill showed that Garden-of-Eden theorem [2], [3]. A binary relation over the configurations is said to be "parallel" if it is induced by a cellular (tessellation) automaton. Richardson showed the equivalence between a parallel relation (a nondeterministic parallel map) with the quiescent state to be injective and its inverse to be parallel by the Garden-of-Eden theorem plus compactn...
متن کاملOne-Dimensional Cellular Automata: Injectivity From Unambiguity
New algorithms for deciding the injectivit y of the global update funct ion associat ed with a cellular automaton C A of dimension one are presented. This is done by interpreting each ordered pair dete rmined by the local update function as th e edge of a labeled directed graph GR which has the prope rty that each bi-infinite sequence of states of the cellular automaton is th e sequence of inpu...
متن کاملBI-OBJECTIVE OPTIMIZATION OF RESERVOIR OPERATION BY MULTI-STEP PARALLEL CELLULAR AUTOMATA
Parallel Cellular Automata (PCA) previously has been employed for optimizing bi-objective reservoir operation, where one release is used to meet both objectives. However, if a single release can only be used for one objective, meaning two separate sets of releases are needed, the method is not applicable anymore. In this paper, Multi-Step Parallel Cellular Automata (MSPCA) has been developed fo...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملInduced Subshifts and Cellular Automata
Given a shift subspace over a finitely generated group, we define the subshift induced by it on a larger group. Then we do the same with cellular automata and, while observing that the new automaton can model a different abstract dynamics, we remark several properties that are shared with the old one. After that, we simulate the old automaton inside the new one, and discuss some consequences an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.2307/2041388